Improved bounds for large scale capacitated arc routing problem
نویسندگان
چکیده
منابع مشابه
Improved bounds for large scale capacitated arc routing problem
The Capacitated Arc Routing Problem (CARP) stands among the hardest combinatorial problems to solve or to find high quality solutions. This becomes even more true when dealing with large instances. This paper investigates methods to improve on lower and upper bounds of instances on graphs with over two hundred vertices and three hundred edges, dimensions that, today, can be considered of large ...
متن کاملThe Capacitated Arc Routing Problem: Lower bounds
1997 ii ACKNOWLEDGEMENTS We would like mostly to thank Mr. Peter Keenan, who was as much a partner as a supervisor, for his invaluable time and erudite guidance during the summer. We must also pay tribute to our parents for their encouragement and support, not only for the duration of this dissertation, but throughout the year. ABSTRACT The Capacitated Arc Routing Problem is a NP-hard arc routi...
متن کاملNode Duplication Lower Bounds for the Capacitated Arc Routing Problem
It is well-known that the tight lower bounds determine the effectiveness of the brancn and bound method for the NP-hard problems. In this paper, we present a new lower bounding procedure for the capacitated arc routing problem (CARP), one of the arc routing problems. They give the tight lower bounds and it is easy to develop an exact algorithm usinl~ their network structures.
متن کاملAn improved heuristic for the capacitated arc routing problem
Available online 19 November 2008
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Operations Research
سال: 2013
ISSN: 0305-0548
DOI: 10.1016/j.cor.2013.02.013